Minimax Pointwise Redundancy for Memoryless Models Over Large Alphabets
نویسندگان
چکیده
منابع مشابه
Minimax redundancy for the class of memoryless sources
Let Xn = (X1; ; Xn) be a memoryless source with unknown distribution on a finite alphabet of size k. We identify the asymptotic minimax coding redundancy for this class of sources, and provide a sequence of asymptotically minimax codes. Equivalently, we determine the limiting behavior of the minimax relative entropy minQ maxP D(PX kQX ), where the maximum is over all independent and identically...
متن کاملUniversal Prediction over Large Alphabets
Insurance transfers losses associated with risks to the insurer for a price, the premium. Considering a natural probabilistic framework for the insurance problem, we derive a necessary and sufficient condition on loss models such that the insurer remains solvent despite the losses taken on. In particular, there need not be any upper bound on the loss—rather it is the structure of the model spac...
متن کاملCharacterizing the Asymptotic Per-Symbol Redundancy of Memoryless Sources over Countable Alphabets in Terms of Single-Letter Marginals
The minimum expected number of bits needed to describe a random variable is its entropy, assuming knowledge of the distribution of the random variable. On the other hand, universal compression describes data supposing that the underlying distribution is unknown, but that it belongs to a known set P of distributions. However, since universal descriptions are not matched exactly to the underlying...
متن کاملEfficient Compressed Wavelet Trees over Large Alphabets
The wavelet tree is a flexible data structure that permits representing sequences S[1, n] of symbols over an alphabet of size σ, within compressed space and supporting a wide range of operations on S. When σ is significant compared to n, current wavelet tree representations incur in noticeable space or time overheads. In this article we introduce the wavelet matrix, an alternative representatio...
متن کاملBordered Conjugates of Words over Large Alphabets
The border correlation function attaches to every word w a binary word β(w) of the same length where the ith letter tells whether the ith conjugate w′ = vu of w = uv is bordered or not. Let [u] denote the set of conjugates of the word w. We show that for a 3-letter alphabet A, the set of β-images equals β(An) = B∗ \ ([ abn−1 ] ∪D ) where D = {an} if n ∈ {5, 7, 9, 10, 14, 17}, and otherwise D = ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2012
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2012.2195769